package acwing_05;
import java.io.*;
import java.util.*;
public class _4517_线性DP_最长连续递增序列 {
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st;
	static int N = 100010;
	static int n;
	static int arr[] = new int[N];
	static int dp[] = new int[N];
	public static void main(String[] args) throws IOException {
		n = Integer.parseInt(br.readLine());
		st = new StringTokenizer(br.readLine());
		
		for(int i = 1; i <= n; i++) {
			arr[i] = Integer.parseInt(st.nextToken());
		}
		
		int res = 0;
		for(int i = 1; i <= n; i++) {
			dp[i] = 1;
			if(arr[i] > arr[i-1]) {
				dp[i] = dp[i-1] + 1;
			}
			res = Math.max(res, dp[i]);
		}
		
		
		System.out.println(res);
		
	}
}
